On circular-perfect graphs: A survey
نویسندگان
چکیده
Circular-perfect graphs form a natural superclass of perfect graphs, introduced by Zhu almost 20 years ago: on the one hand due to their definition means more general coloring concept, other as an important class χ-bound with smallest non-trivial χ-binding function χ(G)≤ω(G)+1. In this paper, we survey results about circular-perfect obtained in two last decades, focus whether fascinating properties can be extended superclass. We recall deep algorithmic and underlying polyhedral graph theory, order outline setting main parameters that are also related graphs. Finally, give list open problems.
منابع مشابه
Circular perfect graphs
For 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, · · · , k − 1, in which i ∼ j if d ≤ |i − j| ≤ k − d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgra...
متن کاملPerfect graphs: a survey
Perfect graphs were defined by Claude Berge in the 1960s. They are important objects for graph theory, linear programming and combinatorial optimization. Claude Berge made a conjecture about them, that was proved by Chudnovsky, Robertson, Seymour and Thomas in 2002, and is now called the strong perfect graph theorem. This is a survey about perfect graphs, mostly focused on the strong perfect gr...
متن کاملClaw-free circular-perfect graphs
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs form a superclass of perfect graphs defined by means of this more general coloring concept. This paper studies claw-free circular-perfect graphs. First we prove that ifG is a connected claw-free circular-perfect graph with χ(G) > ω(G), then min{α(G), ω(G)} = 2. We use this resu...
متن کاملConvex-round graphs are circular-perfect
For 1 d k ? d, G d k denotes the graph with vertices 0; 1; : : : ; k ? 1, in which i is adjacent to j if and only if d ji?jj k ?d. A graph G is circular perfect if, for every induced subgraph H of G, the innmum k=d for which H admits a homomorphism to G d k is equal to the supremum k=d for which G d k admits a homomorphism to H. In this paper, we show that all convex-round graphs are circular p...
متن کاملTriangle-free strongly circular-perfect graphs
Zhu [15] introduced circular-perfect graphs as a superclass of the well-known perfect graphs and as an important χ-bound class of graphs with the smallest non-trivial χ-binding function χ(G) ≤ ω(G)+1. Perfect graphs have been recently characterized as those graphs without odd holes and odd antiholes as induced subgraphs [4]; in particular, perfect graphs are closed under complementation [7]. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2021
ISSN: ['1095-9971', '0195-6698']
DOI: https://doi.org/10.1016/j.ejc.2020.103224